F-Monoids

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Product of Finite Monoids By: F. Blanchet-Sadri and F. Dale Gaddis

In this paper, for each positive integer m, we associate with a finite monoid S0 and m finite commutative monoids S1,..., Sm, a product ◊m(Sm,..., S1, S0) . We give a representation of the free objects in the pseudovariety ◊m(Wm,..., W1, W0) generated by these (m + 1)-ary products where Si ∈ Wi for all 0 ≤ i ≤ m. We then give, in particular, a criterion to determine when an identity holds in ◊m...

متن کامل

Garside monoids vs divisibility monoids

Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations (resp. be of Coxeter ty...

متن کامل

Ordered monoids and J-trivial monoids

In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...

متن کامل

Cartesian Monoids

The Cartesian monoid of partial piecewise shift operators is developed as a model for programming systems such as Backus’ FP. Special attention is paid to those elements which are equationally implicitly definable.

متن کامل

Data Monoids

We develop an algebraic theory for languages of data words. We prove that, under certain conditions, a language of data words is definable in first-order logic if and only if its syntactic monoid is aperiodic. 1 Introduction This paper is an attempt to combine two fields. The first field is the algebraic theory of regular languages. In this theory, a regular language is represented by its synta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Algebra

سال: 2007

ISSN: 0092-7872,1532-4125

DOI: 10.1080/00927870701326494